On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
نویسندگان
چکیده
Does the trace language of a given vector addition system (VAS) intersect with a given context-free language? This question lies at the heart of several verification questions involving recursive programs with integer parameters. In particular, it is equivalent to the coverability problem for VAS that operate on a pushdown stack. We show decidability in dimension one, based on an analysis of a new model called grammarcontrolled vector addition systems.
منابع مشابه
Well - structured pushdown system , Part 1 : Decidable classes for coverability ?
Pushdown systems (PDSs) model single-thread recursive programs, and well-structured transition systems (WSTSs), such as vector addition systems, are useful to represent non-recursive multi-thread programs. Combining these two ideas, our goal is to investigate wellstructured pushdown systems (WSPDSs), pushdown systems with wellquasi-ordered control states and stack alphabet. This paper focuses o...
متن کاملWell-Structured Pushdown Systems
Pushdown systems (PDSs) model single-thread recursive programs, and well-structured transition systems (WSTSs), such as vector addition systems, are useful to represent non-recursive multi-thread programs. Combining these two ideas, our goal is to investigate wellstructured pushdown systems (WSPDSs), pushdown systems with wellquasi-ordered control states and stack alphabet. This paper focuses o...
متن کاملWhat Makes Petri Nets Harder to Verify: Stack or Data?
We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets: Ackermann-hardness for unordered data Petri nets, and Tower-hardness for pushdown vector addition systems.
متن کاملThe Termination/Boundedness Problem of Well-Structured Pushdown Systems
Recently, models that combine vector addition systems and pushdown systems have attracted lots of attentions. They can model some classes of concurrent recursive computations, still enjoying certain decidability properties. A well-structured pushdown system (WSPDS) [1] has been proposed to unify such models. It extends a pushdown system with (possibly infinitely many) well-quasi-ordered states ...
متن کاملOn Büchi One-Counter Automata
Equivalence of deterministic pushdown automata is a famous problem in theoretical computer science whose decidability has been shown by Sénizergues. Our first result shows that decidability no longer holds when moving from finite words to infinite words. This solves an open problem that has recently been raised by Löding. In fact, we show that already the equivalence problem for deterministic B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015